Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits

Each (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivious (disjunctive) branching program of width exp(O(A)) which has the same multiplicity of reading as C. That is why exponential lower bounds on the width of (disjunctive) oblivious branching programs of linear depth provide lower bounds of order Sl(nlm2’), 0 <a < i, on the area of (nondeterministic) multilective VLSI-circuits computing explicitly delined one-output Boolean functions, if the multiplicity of reading is bounded by O(log”n). Lower bounds are derived for the sequence equality problem (SEQ) and the graph accessibility problem (GAP).